Spray coating process variable and property analysis of UV-curable polyurethane acrylate coating on polycarbonate substrate

A series of spray coating experiments were conducted on an UV-curable, polyurethane-modified, acrylate-based coating formulation with the aim to control defects, coating thickness, and thickness variation. Statistical approaches including design of experiment, residual examination, analysis of variance, and t-test were used in designing the experiments and analyzing data. Viscosity of formulation, atomizing pressure, liquid feeding pressure, distance between nozzle and substrate, and travel speed of substrate were the process variables studied. The ranges of process variables that gave defect-free coating were identified and used in the subsequent experiments to determine process variables and interactions that had significant contribution to the changes in coating thickness and thickness variation. All process variables studied were found to have contribution to the change in coating thickness, but they showed no significant contribution to the variation of coating thickness. No interaction displayed significant contribution. Confirmation tests performed on extra samples prepared with varying coating thicknesses indicated a good agreement with the experimental results. Additional samples were tested for total transmittance, transmission haze, adhesion, surface roughness, hardness, scratch hardness, abrasion resistance, and durability to attack of car wash chemicals. Spray coated samples showed slight improvement in the total transmittance over the uncoated samples, while maintaining the transmission haze and exhibiting rougher surfaces. Only samples with thin coatings were found to possess sufficient adhesion to the substrate. These thin coatings gave improved hardness, scratch hardness, and durability to car wash attack to the level comparable to commercial coated polycarbonate headlamp lenses, whilst giving better abrasion resistance.     

Distributed wireless power transfer in sensor networks with multiple Mobile Chargers

We investigate the problem of efficient wireless power transfer in wireless sensor networks. In our approach, special mobile entities (called the Mobile Chargers) traverse the network and wirelessly replenish the energy of sensor nodes. In contrast to most current approaches, we envision methods that are distributed and use limited network information. We propose four new protocols for efficient charging, addressing key issues which we identify, most notably (i) what are good coordination procedures for the Mobile Chargers and (ii) what are good trajectories for the Mobile Chargers. Two of our protocols (DC, DCLK) perform distributed, limited network knowledge coordination and charging, while two others (CC, CCGK) perform centralized, global network knowledge coordination and charging. As detailed simulations demonstrate, one of our distributed protocols outperforms a known state of the art method, while its performance gets quite close to the performance of the powerful centralized global knowledge method.     

Data monitoring and sports injury prediction model based on embedded system and machine learning algorithm

Managing sports performance is very important in the sports industry. Performance, the executives, centers on boosting competitor execution and decreasing the danger of injury. Several factors contribute to these goals, including player health, emotional status, exercise load and physical intensity requirements. Generally speaking, injury prediction is an essential component of injury prevention, and successful identification of injury prediction is a primary indicator for effective prevention. The proposed Artificial Neural Network (ANN) objective is to develop and use early-doing ability and exercise load data to validate a hierarchical machine learning prediction system with accurate detection of player injuries. The physical and workload that requires detection of this early personalized damage can be avoided with specific help. The framework is used to test 21 soccer players’ sports information from various sources, including gathered and inside burden information, outside burden information, and review information. The entirety of this information is fused into the proposed framework to improve the exactness of harm expectation. This calculation distinguishes competitors in danger of injury, with their early intervention available.     

Intrinsic nonlinear multiscale image decomposition: A 2D empirical mode decomposition-like tool

Many works have been achieved for analyzing images with a multiscale approach. In this paper, an intrinsic and nonlinear multiscale image decomposition is proposed, based on partial differential equations (PDEs) and the image frequency contents. Our model is inspired from the 2D empirical mode decomposition (EMD) for which a theoretical study is quite nonexistent, mainly because the algorithm is based on heuristic and ad hoc elements making its mathematical study hard. This work has three main advantages. Firstly, we prove that the 2D sifting process iterations are consistent with the resolution of a nonlinear PDE, by considering continuous morphological operators to build local upper and lower envelopes of the image extrema. In addition to the fact that now differential calculus can be performed on envelopes, the introduction of such morphological filters eliminates the interpolation dependency that also terribly suffers the method. Also, contrary to former 2D empirical modes, precise mathematical definition for a class of functions are now introduced thanks to the nonlinear PDE derived from the consistency result, and their characterization on the basis of Meyer spaces. Secondly, an intrinsic multiscale image decomposition is introduced based on the image frequency contents; the proposed approach almost captures the essence and philosophy of the 2D EMD and is linked to the well known Absolutely Minimizing Lipschitz Extension model. Lastly, the proposed multiscale decomposition allows a reconstruction of images. The filterbank capability of the new multiscale decomposition algorithm is shown both on synthetic and real images, and results show that our proposed approach improves a lot on the 2D EMD. Moreover, the complexity of the proposed multiscale decomposition is very reduced compared to the 2D EMD by avoiding the surface interpolation approach, which is the core of all 2D EMD algorithms and is very time consuming. For that purpose also, our work will then be a great benefit; especially, in higher dimension spaces.     

基于SOA的高校教学管理平台

通过分析高校教学管理目前信息化面临的问题,提出基于SOA体系结构对目前的应用系统进行整合,实现各应用系统之间的协同工作。描述了教学管理平台的需求、体系结构、设计思路,说明了在开发过程中所使用的关键技术。同时在实现了基于SOA体系结构的教学管理平台之后,在移动终端上开发了相应的客户端应用程序,使学生能够实时了解相关教学信息。     

信标可控性定义及问题

死锁是资源分配系统中极不希望出现的现象,目前死锁控制的一个重要的方法是信标控制法,信标控制法的基础是信标可控性的定义.对于普通Petri网,已有一个完善的信标可控性定义,而对于一般Petri网,这方面的工作还需改进和完善.近年来,学者们针对一般Petri 网及其子类提出了不少信标可控性定义,但这些定义并不完善,仍有大量的问题亟待解决.首先回顾了文献中的各个信标可控性定义,提出了两个新的信标可控性定义,然后从可控性定义的宽松程度、应用范围以及等价性等方面分析比较了现有的信标可控性定义优缺点.最后给出了今后的研究方向.     

A hybrid hub-and-spoke postal logistics network with realistic restrictions: A case study of Korea Post

Postal logistics has a complex transportation network for efficient mail delivery. Therefore, a postal logistics network consists of various functional sites with a hybrid hub-and-spoke structure. More specifically, there are multiple Delivery & Pickup Stations (D&PSs), multiple Mail Processing Centers (MPCs), and one Exchange Center (EC). In this paper, we develop two mathematical models with realistic restrictions for Korea Post for the current postal logistics network by simultaneously considering locations and allocations. We propose an Integer Linear Programming (ILP) model for transportation network organization and vehicle operation and a Mixed Integer Linear Programming (MILP) model that considers potential ECs for decision making while simultaneously regarding the EC location, transportation network organization, and vehicle operation. We use modified real data from Korea Post. Additionally, we consider several scenarios for supporting EC decision makers. The proposed models and scenarios are very useful in decision making for postal logistics network designers and operators.     

Automatic inpainting by removing fence-like structures in RGBD images

Recent inpainting techniques usually require human interactions which are labor intensive and dependent on the user experiences. In this paper, we introduce an automatic inpainting technique to remove undesired fence-like structures from images. Specifically, the proposed technique works on the RGBD images which have recently become cheaper and easier to obtain using the Microsoft Kinect. The basic idea is to segment and remove the undesired fence-like structures by using both depth and color information, and then adapt an existing inpainting algorithm to fill the holes resulting from the structure removal. We found that it is difficult to achieve a satisfactory segmentation of such structures by only using the depth channel. In this paper, we use the depth information to help identify a set of foreground and background strokes, with which we apply a graph-cut algorithm on the color channels to obtain a more accurate segmentation for inpainting. We demonstrate the effectiveness of the proposed technique by experiments on a set of Kinect images.     

Garbage collection of multi-version indexed data on flash memory

Maintaining a multi-version index on flash memory could generate a lot of updates and invalid pages. It is important to have an efficient garbage collection mechanism to ensure the flash memory has sufficient number of free blocks for storing new data versions and their index structures. In this paper, we study the important performance issues in using the purging-range query to reclaim the blocks, which are storing old data versions and invalid index entries, to be free blocks. To reduce the cost for processing the purging-range query, we propose the physical block labeling (PBL) scheme to provide a better estimation on the purging version number to be used for purging old data versions. To further enhance the performance of the garbage collection process, and at the same time to maximize the deadspans of data versions and balance the wear levels of the blocks, we propose two schemes called, the sequential placement (SQ) and frequency-based placement (FBP), for placing new data versions into free pages. As illustrated in the performance studies, both SQ and FBP can effectively balance the wear levels of the blocks. The deadspans of data versions are longer under FBP than both SQ and RR, and the page reallocation cost is also lower under FBP especially when the size of flash memory allocated for the database is limited. The experimental results also illustrate that PBL can effectively minimize the number of invocations of the purging-range query to be one to reclaim the required number of blocks in each garbage collection.     

一种改进HOG特征的行人检测算法

针对HOG特征检测准确率高、计算量大的特点,通过对HOG特征的结构进行调整,提出了使用Fisher特征挑选准则来挑选出有区别能力的行人特征块,得到MultiHOG特征。该算法结合线性SVM二值分类器,实现行人滑动窗口检测。用Inria标准数据集和自行拍摄数据集进行了测试,结果证明该算法较HOG在准确率及实时性上都有很大的提高。